Random Permutations and Bernoulli Sequences

نویسندگان

  • Dominique Foata
  • DOMINIQUE FOATA
چکیده

— The so-called first fundamental transformation provides a natural combinatorial link between statistics involving cycle lengths of random permutations and statistics dealing with runs on Bernoulli sequences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connections between Bernoulli Strings and Random Permutations

A sequence of random variables, each taking only two values ”0” or ”1”, is called a Bernoulli sequence. Consider the counts of occurrences of strings of the form {11}, {101}, {1001}, . . . in Bernoulli sequences. Counts of such Bernoulli strings arise in the study of the cycle structure of random permutations, Bayesian nonparametrics, record values etc. The joint distribution of such counts is ...

متن کامل

A Study of Counts of Bernoulli Strings via Conditional Poisson Processes

A sequence of random variables, each taking values 0 or 1, is called a Bernoulli sequence. We say that a string of length d occurs in a Bernoulli sequence if a success is followed by exactly (d − 1) failures before the next success. The counts of such d-strings are of interest, and in specific independent Bernoulli sequences are known to correspond to asymptotic d-cycle counts in random permuta...

متن کامل

Counts of Failure Strings in Certain Bernoulli Sequences

In a sequence of independent Bernoulli trials the probability for success in the k:th trial is pk, k = 1, 2, . . . . The number of strings with given number of failures between two subsequent successes is studied. Explicit expressions for distributions and moments are obtained for pk = a/(a + b + k − 1), a > 0, b ≥ 0. Also the limit behaviour of the longest failure string in the first n trials ...

متن کامل

Synchronization of Bernoulli sequences on shared letters

The topic of this paper is the distributed and incremental generation of long executions of concurrent systems, uniformly or more generally with weights associated to elementary actions. Synchronizing sequences of letters on alphabets sharing letters are known to produce a trace in the concurrency theoretic sense, i.e., a labeled partially ordered set. We study the probabilistic aspects by cons...

متن کامل

Bernoulli Trials and Permutation

Abst.rot Several coin-tossing games are surveyed which, in a natural way, give rise to "statistically" induced probability measures on the set of permutations of {1, 2 n} and on sets of multipermutations. The distributions of a general class of random variables known as binary tree statistics are also given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004